Nucleoluses of Compound Simple Games
نویسندگان
چکیده
منابع مشابه
Kernels of Compound Games with Simple Components
The kernel is a solution concept for a cooperative game. It reflects symmetry properties of the characteristic function and desirability relations over the set of the players. Given m games over disjoint sets of players and an m-person game,one defines a compound game over the union of the m disjoint sets. These m games are the components and the above rnperson game is called the quotient. The ...
متن کاملSimple Compound Splitting for German
INTRODUCTION • Compound: concatention of two or more words Apfel|baum (apple tree) Apfel|kuchen|rezept|sammlung (apple cake recipe collection) • Productive word formation process → infinite amount of possible compounds • Compound splitting useful for many NLP applications – Statistical Machine translation: translation of new compounds, better lexical coverage – Information retrieval: better gen...
متن کاملSolving Simple Stochastic Games
We present a new algorithm for solving Simple Stochastic Games (SSGs), which is fixed parameter tractable when parametrized with the number of random vertices. This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is O( |VR|! · (log(|V |)|E| + |p|) ), where |V |, |VR|, |E| and |p| are respectively the number of ver...
متن کاملSimple Recursive Games
We define the class of simple recursive games. A simple recursive game is defined as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving simple recursive games and obtain an almost-linear time comparison-based algorithm for computing an equilibrium of such a game. The existence of a ...
متن کاملSimple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in the graph. The focus here is on simple stochastic parity games, that is, two-player games with turn-based probabilistic transitions and ω-regular objectives formalized as parity (Rabin chain) winning conditions. An effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 1974
ISSN: 0036-1399,1095-712X
DOI: 10.1137/0126057